package algorithm.dp;

// 最小路径和
public class LC64 {
    public int minPathSum(int[][] grid) {
        // 1. 创建 dp 表
        int m = grid.length, n = grid[0].length;
        int[][] dp = new int[m+1][n+1];

        // 2. 初始化
        for (int j = 0; j <= n; j++) dp[0][j] = Integer.MAX_VALUE;
        for (int i = 0; i <= m; i++) dp[i][0] = Integer.MAX_VALUE;
        dp[0][1] = 0; dp[1][0] = 0;

        // 3. 填表
        for (int i = 1; i <= m; i++)
            for (int j = 1; j <= n; j++)
                dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i-1][j-1];
        return dp[m][n];
    }
}
